Block codes on pomset metric
نویسندگان
چکیده
Given a regular multiset [Formula: see text] on text], partial order and label map defined by with we define pomset block metric the direct sum of based text]. The extends classical introduced Sudha Selvaraj generalizes poset Alves et al. over space is called determine complete weight distribution it. Further, text]-perfect codes for ideals full counts are described. Then, chain pomset, packing radius Singleton bound established. relation between maximum distance separable (MDS) any ideal investigated. Moreover, duality theorem an MDS code established when all blocks have same size.
منابع مشابه
Decoding of Block and Convolutional Codes in Rank Metric DISSERTATION
Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays...
متن کاملDecoding of block and convolutional codes in rank metric
R ank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowaday...
متن کاملOn the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels
Most of the basic concepts of algebraic coding theory are derived for the memoryless binary symmetric channel. These concepts do not necessarily hold for time-varying channels or for channels with memory. However, errors in real-life channels seem to occur in bursts rather than independently, suggesting that these channels exhibit some statistical dependence or memory. Nonetheless, the same alg...
متن کاملPomset mcfgs
This paper identifies two orthogonal dimensions of context sensitivity, the first being context sensitivity in concurrency and the second being structural context sensitivity. We present an example from natural language which seems to require both types of context sensitivity, and introduce partially ordered multisets (pomsets) mcfgs as a formalism which succintly expresses both.
متن کاملRank-metric LCD codes
In this paper, we investigate the rank-metric codes which are proposed by Delsarte and Gabidulin to be complementary dual codes. We point out the relationship between Delsarte complementary dual codes and Gabidulin complementary dual codes. In finite field Fmq , we construct two classes of Gabidulin LCD MRD codes by self-dual basis (or almost self-dual basis) of Fmq over Fq. Under a suitable co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asian-european Journal of Mathematics
سال: 2023
ISSN: ['1793-7183', '1793-5571']
DOI: https://doi.org/10.1142/s1793557123501711